On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Computational resources
• Structural complexity theory
• Theoretical computer science
• MapReduce
• Time hierarchy theorem
• NTIME
• Time complexity
• DSPACE
• SL

THE EFFECT OF WORD FREQUENCY ON THE TIMECOURSE OF TONOGENESIS IN SEOUL KOREAN Hye-Young Banga , Morgan Sondereggera , Yoonjung Kangb , Meghan Clayardsa & Tae-Jin Yoonc a McGill University, Candada; b University of Toron

Source URL: people.linguistics.mcgill.ca

• Linguistics
• Linguistic typology
• Phonetics
• Culture
• Voice-onset time
• Aspirated consonant
• Speech perception
• Stop consonant
• Korean language
• Tone
• Consonant
• Laryngeal theory

Microcanonical multifractal analysis of electric potential maps on the heart surface Oriol Pont∗a,b , Hussein Yahiaa , R´emi Duboisb a b

Source URL: geostat.bordeaux.inria.fr

• Fractals
• Dimension theory
• Mathematics
• Multifractal system
• Dynamical systems
• Analysis
• Systems science
• Fractal analysis
• Time series
• Singularity

CHAOS 22, Effect of discrete time observations on synchronization in Chua model and applications to data assimilation Md. Nurujjaman,1,a) Sumanth Shivamurthy,2 Amit Apte,2,b) Tanu Singla,3 and P. Parmanand

Source URL: home.icts.res.in

• Statistics
• Knowledge
• Epistemology
• Control theory
• Regression analysis
• Statistical forecasting
• Error
• Measurement
• Data assimilation
• Chaos theory
• Kalman filter
• Lyapunov exponent

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

W. Zimmerman dialectica Vol. 59, N° ), pp. 401–457 The A-Theory of Time, The B-Theory of Time, and ‘Taking Tense Seriously’

Source URL: fas-philosophy.rutgers.edu

Supplementary Information Quantifying the effect of temporal resolution in time-varying networks B. Ribeiro, N. Perra, A. Baronchelli December 4, 2012 In this supplementary information appendix we cover some details left

Source URL: www.nicolaperra.com

• Network theory
• Time-varying network
• Rectangular function
• Networks

BE. / B.Tech 1st & 2nd Sem - Page-1 MAHARSHI DAYANAND UNIVERSITY, ROHTAK Theory Date-Sheet for B.E / B.Tech. 1st & 2nd Sem. Examinations DecJan-2012 Time of ExamAM toPM / Date & Day

Source URL: www.mdurohtak.ac.in

Space-Efficient Parallel Algorithms for Combinatorial Search Problems? A. Pietracaprina1 , G. Pucci1 , F. Silvestri1 , and F. Vandin2 1 University of Padova, Dip. Ingegneria dell’Informazione, Padova, Italy

Source URL: www.itu.dk

• Computational complexity theory
• Analysis of algorithms
• Tree traversal
• Tree
• B-tree
• Rope
• Time complexity
• Randomized algorithm
• Binary search tree
• Theoretical computer science
• Binary trees
• Graph theory

Chapter 1 PROVIDING QOS IN LARGE NETWORKS: STATISTICAL MULTIPLEXING AND ADMISSION CONTROL Nikolay B. Likhanov Institute for Problems of Information Transmission, Moscow, Russia

Source URL: ece.uwaterloo.ca

• Computing
• Streaming
• Telecommunications engineering
• Electronic engineering
• Quality of service
• Statistical time division multiplexing
• Transmission Control Protocol
• Packet loss
• Large deviations theory
• Teletraffic
• Network architecture
• Network performance